#include<iostream>
#include"BSTree_R.h"
using namespace std;



int main()
{
	BS::BSTree<int>* b1 = new BS::BSTree<int>();

	b1->InOrder();

	int arr[] = { 5, 3, 4, 1, 0, 2, 7, 8, 6, 9 };
	for (auto e : arr)
	{
		b1->InsertR(e);
	}
	b1->InOrder();

	int arr2[] = { 3, 9, 0, 1, 5, 7, 8};
	for (auto e : arr2)
	{
		b1->EraseR(e);
	}
	b1->InOrder();

	BS::BSTree<int>* b2 = new BS::BSTree<int>(*b1);
	b2->InOrder();

	BS::BSTree<int>* b3 = new BS::BSTree<int>();
	*b3 = *b1;
	b3->InOrder();
	//int arr[] = { 5, 3, 4, 1, 0, 2, 7, 8, 6, 9 };
	//for (auto e : arr)
	//{
	//	b1->Insert(e);
	//}
	//b1->InOrder();

	//int arr2[] = { 3, 9, 0, 1, 5, 7, 8};
	//for (auto e : arr)
	//{
	//	b1->Erase(e);
	//}
	//b1->InOrder();
	return 0;
}